Diagonalization in proof complexity
نویسنده
چکیده
منابع مشابه
Representing and Reformulating Diagonalization Methods
Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one proof-plan can be analogically transferred to an operator used in another proof-plan. Finally, we nd an operat...
متن کاملAn Example of a Theorem that has Contradictory Relativization and Diagonalization Proof
The central questions in complexity theory (e.g. the P =?NP question) can only be solved with proof techniques that do not relativize [BGS75]. There had been some debate about whether such techniques are within reach of the “current state of mathematics” [Hop84]. Recent advances in the area of interactive protocols have produced techniques that do not relativize [Sha90, LFKN90, HCRR90]. However...
متن کاملInfinitely-Often Universal Languages and Diagonalization
Diagonalization is a powerful technique in recursion theory and in computational complexity [2]. The limits of this technique are not clear. On the one hand, many people argue that conflicting relativizations mean a complexity question cannot be resolved using only diagonalization. On the other hand, it is not clear that diagonalization arguments necessarily relativize. In [5], the authors prop...
متن کاملBarriers in Complexity Theory
Several proof methods have been successfully employed over the years to prove several important results in Complexity Theory, but no one has been able to settle the question P =?NP. This article surveys three of the main proof methods used in Complexity Theory, and then shows that they cannot be used to prove P =?NP, thus exposing technical barriers to the advance of Complexity Theory. The firs...
متن کاملRelations Between Diagonalization, Proof Systems, and Complexity Gaps
In this paper we study diagonal processes over time bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal pro& that they operate in the given time bound. This replaces the traditional “clock” jr. .-zsource bounded diagonalization by formal proofs about running times and establishes close relations between properties of proof syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2004